\section{apriori::apriori\_\-alg$<$ transaction, collection $>$ Class Template Reference}
\label{classapriori_1_1apriori__alg}\index{apriori::apriori_alg@{apriori::apriori\_\-alg}}
{\tt \#include $<$apriori.h$>$}

Collaboration diagram for apriori::apriori\_\-alg$<$ transaction, collection $>$:\begin{figure}[H]
\begin{center}
\leavevmode
\includegraphics[width=163pt]{classapriori_1_1apriori__alg__coll__graph}
\end{center}
\end{figure}
\subsection*{Public Types}
\begin{CompactItemize}
\item 
typedef transaction::ptr \bf{trans\_\-ptr}\label{classapriori_1_1apriori__alg_6f6414dee47b999199f9448281f4b068}

\item 
typedef collection$<$ \bf{trans\_\-ptr} $>$ \bf{coll}\label{classapriori_1_1apriori__alg_a95856a3b5e96762f9b0980256310c20}

\item 
typedef \bf{itemset\_\-container}$<$ transaction, collection $>$ \bf{t\_\-itemset\_\-c}\label{classapriori_1_1apriori__alg_afded643ee653a24ba3ae4ca05e4de4f}

\item 
typedef \bf{t\_\-itemset\_\-c::t\_\-item} \bf{t\_\-item}\label{classapriori_1_1apriori__alg_a4034506ff3d88d72397e7e308c56669}

\end{CompactItemize}
\subsection*{Public Member Functions}
\begin{CompactItemize}
\item 
\bf{apriori\_\-alg} (const \bf{coll} \&trans, int mins, int minc)
\begin{CompactList}\small\item\em The standard-constructor, which initializes the algorithm. \item\end{CompactList}\item 
\bf{$\sim$apriori\_\-alg} ()\label{classapriori_1_1apriori__alg_260e714bfb79805460e9c3514aaa545b}

\item 
void \bf{doit} ()
\begin{CompactList}\small\item\em Executes the algorithm. \item\end{CompactList}\item 
list$<$ \bf{t\_\-item} $>$ \& \bf{get\_\-result} ()\label{classapriori_1_1apriori__alg_92d079bd6a8bf30c486bfe4940f40716}

\item 
const list$<$ \bf{t\_\-item} $>$ \& \bf{get\_\-result} () const \label{classapriori_1_1apriori__alg_127fd50050b6bba2b57db8019d129c46}

\end{CompactItemize}


\subsection{Detailed Description}
\subsubsection*{template$<$class transaction, template$<$ class $>$ class collection$>$ class apriori::apriori\_\-alg$<$ transaction, collection $>$}

The main-class which implements the apriori-algorithm. This class takes 2 template parameters. The first is the type of the transaction, which elements must implement the ==-operator, and the class itself must implement the get\_\-elements-method. The second parameter declares the collection (list, vector, ...), in which the transactions are stored. The collection must be iterateable (define iterator, begin() and end() method). \begin{Desc}
\item[Author:]Michael Opitz \end{Desc}
\begin{Desc}
\item[Version:]0.1 \end{Desc}




Definition at line 35 of file apriori.h.

\subsection{Constructor \& Destructor Documentation}
\index{apriori::apriori_alg@{apriori::apriori\_\-alg}!apriori_alg@{apriori\_\-alg}}
\index{apriori_alg@{apriori\_\-alg}!apriori::apriori_alg@{apriori::apriori\_\-alg}}
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class transaction, template$<$ class $>$ class collection$>$ \bf{apriori::apriori\_\-alg}$<$ transaction, collection $>$::\bf{apriori\_\-alg} (const \bf{coll} \& {\em trans}, int {\em mins}, int {\em minc})\hspace{0.3cm}{\tt  [inline]}}\label{classapriori_1_1apriori__alg_fbf803567d7cfde8d4070ec955091468}


The standard-constructor, which initializes the algorithm. 

The standard-constructor, which initializes the algorithm \begin{Desc}
\item[Parameters:]
\begin{description}
\item[{\em trans}]is a collection of transactions \item[{\em mins}]is the minimal support value \item[{\em minc}]is the minimal confidence value (not supported!!) \end{description}
\end{Desc}


Definition at line 52 of file apriori.h.

\subsection{Member Function Documentation}
\index{apriori::apriori_alg@{apriori::apriori\_\-alg}!doit@{doit}}
\index{doit@{doit}!apriori::apriori_alg@{apriori::apriori\_\-alg}}
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class transaction, template$<$ class $>$ class collection$>$ void \bf{apriori::apriori\_\-alg}$<$ transaction, collection $>$::doit ()\hspace{0.3cm}{\tt  [inline]}}\label{classapriori_1_1apriori__alg_0441003fed04902561d35ce63b4719ff}


Executes the algorithm. 

Executes the algorithm. The results are stored in \_\-result, and can be retrieved through getter methods. 

Definition at line 62 of file apriori.h.

References apriori::itemset\_\-container$<$ transaction, collection $>$::cut(), apriori::itemset\_\-container$<$ transaction, collection $>$::generate(), apriori::itemset\_\-container$<$ transaction, collection $>$::get\_\-items(), and apriori::itemset\_\-container$<$ transaction, collection $>$::initialize().

Here is the call graph for this function:\begin{figure}[H]
\begin{center}
\leavevmode
\includegraphics[width=337pt]{classapriori_1_1apriori__alg_0441003fed04902561d35ce63b4719ff_cgraph}
\end{center}
\end{figure}


The documentation for this class was generated from the following file:\begin{CompactItemize}
\item 
Desktop/newapriori/apriori.h\end{CompactItemize}
